A Limiting Rst Order Realizability Interpretation
نویسندگان
چکیده
Constructive Mathematics might be regarded as a fragment of classical mathematics in which any proof of an existence theorem is equipped with a computable function giving the solution of the theorem. Limit Computable Mathematics (LCM) considered in this note is a fragment of classical mathematics in which any proof of an existence theorem is equipped with a function computing the solution of the theorem in the limit. Computation in the limit, or more formally, limiting recursion, is a central notion of learning theory by Gold and Putnam 9, 21, 18]. We will show that a realizability interpretation via limiting recursive functions is a natural modeling of LCM for rst order arithmetic. We will point out that this will enable automatic extraction of limit-algorithms from some classical proofs of well-known transsnite theorems, e.g., Hilbert's original proof of his famous nite basis theorem, once blamed as \theology" by P. Gordan.
منابع مشابه
9- Algebraization of realizability
In the rst parts of this thesis, we introduced several calculi for which we gave a Krivine realizability interpretation. Namely, in addition to Krivine’s λc -calculus, we presented interpretations for the callby-name, call-by-value and call-by-need λμμ̃-calculi, for dLt̂p and for dLPAω . Amongst others, we could cite Munch-Maccagnoni’s interpretation for System L [126], Lepigre’s interpretation ...
متن کامل9- Algebraization of realizability
In the rst parts of this thesis, we introduced several calculi for which we gave a Krivine realizability interpretation. Namely, in addition to Krivine’s λc -calculus, we presented interpretations for the callby-name, call-by-value and call-by-need λμμ̃-calculi, for dLt̂p and for dLPAω . Amongst others, we could cite Munch-Maccagnoni’s interpretation for System L [126], Lepigre’s interpretation ...
متن کاملA Curry-Style Realizability Interpretation for Monotone Inductive Definitions
The logical system AF2μ, an extension of second-order predicate calculus with monotone inductive definitions, is presented. Some properties of this system are shown including that it is a good system for extracting programs from proofs by means of a realizability interpretation in the style of Krivine-Parigot, where the realizers are terms of the Curry-system of λ-calculus and the realizability...
متن کاملOn Krivine's Realizability Interpretation of Classical Second-Order Arithmetic
This article investigates Krivine’s realizability interpretation of classical second-order arithmetic and its recent extension handling countable choice. We will start by presenting a two-step interpretation which first eliminates classical logic via a negative translation and then applies standard realizability interpretation. We then argue that a slight variant of Krivine’s interpretation cor...
متن کاملInteractive Realizability, Monads and Witness Extraction
In this dissertation we collect some results about “interactive realizability”, a realizability semantics that extends the Brouwer-Heyting-Kolmogorov interpretation to (sub-)classical logic, more precisely to first-order intuitionistic arithmetic (Heyting Arithmetic, HA) extended by the law of the excluded middle restricted to Σ1 formulas (EM1), a system motivated by its interest in proof minin...
متن کامل